0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n027.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 02:17:21 EDT 2022 0.13/0.34 % CPUTime : 0.20/0.47 Running higher-order on 8 cores theorem proving 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.48 # Version: 3.0pre003-ho 0.20/0.49 # Preprocessing class: HSMSSMSSMLLNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting new_ho_10_cnf2 with 600s (5) cores 0.20/0.49 # Starting post_as_ho3 with 120s (1) cores 0.20/0.49 # Starting new_ho_12 with 120s (1) cores 0.20/0.49 # Starting new_bool_2 with 120s (1) cores 0.20/0.49 # post_as_ho3 with pid 29163 completed with status 0 0.20/0.49 # Result found by post_as_ho3 0.20/0.49 # Preprocessing class: HSMSSMSSMLLNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting new_ho_10_cnf2 with 600s (5) cores 0.20/0.49 # Starting post_as_ho3 with 120s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGUNM-FFMF21-SHSSMFNN 0.20/0.49 # partial match(1): HGUNS-FFMF21-SHSSMFNN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.49 # Starting new_ho_10 with 65s (1) cores 0.20/0.49 # new_ho_10 with pid 29168 completed with status 0 0.20/0.49 # Result found by new_ho_10 0.20/0.49 # Preprocessing class: HSMSSMSSMLLNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting new_ho_10_cnf2 with 600s (5) cores 0.20/0.49 # Starting post_as_ho3 with 120s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGUNM-FFMF21-SHSSMFNN 0.20/0.49 # partial match(1): HGUNS-FFMF21-SHSSMFNN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.49 # Starting new_ho_10 with 65s (1) cores 0.20/0.49 # Preprocessing time : 0.002 s 0.20/0.49 # Presaturation interreduction done 0.20/0.49 0.20/0.49 # Proof found! 0.20/0.49 # SZS status Theorem 0.20/0.49 # SZS output start CNFRefutation 0.20/0.49 thf(decl_22, type, mrel: mworld > mworld > $o). 0.20/0.49 thf(decl_23, type, mactual: mworld). 0.20/0.49 thf(decl_24, type, mlocal: (mworld > $o) > $o). 0.20/0.49 thf(decl_25, type, mnot: (mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_30, type, mbox: (mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_31, type, mdia: (mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_32, type, mforall_di: ($i > mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_33, type, mexists_di: ($i > mworld > $o) > mworld > $o). 0.20/0.49 thf(decl_34, type, qmltpeq: $i > $i > mworld > $o). 0.20/0.49 thf(decl_35, type, member: $i > $i > mworld > $o). 0.20/0.49 thf(decl_36, type, subset: $i > $i > mworld > $o). 0.20/0.49 thf(decl_37, type, union: $i > $i > $i). 0.20/0.49 thf(decl_38, type, esk1_1: mworld > mworld). 0.20/0.49 thf(decl_39, type, esk2_2: $i > $i > $i). 0.20/0.49 thf(decl_40, type, esk3_2: $i > $i > $i). 0.20/0.49 thf(decl_41, type, esk4_0: $i). 0.20/0.49 thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mlocal_def)). 0.20/0.49 thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:((X6 @ X7 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mforall_di_def)). 0.20/0.49 thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mimplies_def)). 0.20/0.49 thf(prove_idempotency_of_union, conjecture, (mlocal @ (mforall_di @ (^[X32:$i]:(qmltpeq @ (union @ X32 @ X32) @ X32)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_idempotency_of_union)). 0.20/0.49 thf(subset_union, axiom, (mlocal @ (mforall_di @ (^[X17:$i]:(mforall_di @ (^[X10:$i]:(mimplies @ (subset @ X17 @ X10) @ (qmltpeq @ (union @ X17 @ X10) @ X10))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', subset_union)). 0.20/0.49 thf(reflexivity_of_subset, axiom, (mlocal @ (mforall_di @ (^[X16:$i]:(subset @ X16 @ X16)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', reflexivity_of_subset)). 0.20/0.49 thf(c_0_6, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])). 0.20/0.49 thf(c_0_7, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_di_def])). 0.20/0.49 thf(c_0_8, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])). 0.20/0.49 thf(c_0_9, negated_conjecture, ~(![X75:$i]:((qmltpeq @ (union @ X75 @ X75) @ X75 @ mactual))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_idempotency_of_union])]), c_0_6]), c_0_7])). 0.20/0.49 thf(c_0_10, plain, ![X47:$i, X46:$i]:(((subset @ X47 @ X46 @ mactual)=>(qmltpeq @ (union @ X47 @ X46) @ X46 @ mactual))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_union]), c_0_6]), c_0_8]), c_0_7])). 0.20/0.49 thf(c_0_11, plain, ![X45:$i]:((subset @ X45 @ X45 @ mactual)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_of_subset]), c_0_6]), c_0_7])). 0.20/0.49 thf(c_0_12, negated_conjecture, ~(qmltpeq @ (union @ esk4_0 @ esk4_0) @ esk4_0 @ mactual), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])). 0.20/0.49 thf(c_0_13, plain, ![X89:$i, X90:$i]:((~(subset @ X89 @ X90 @ mactual)|(qmltpeq @ (union @ X89 @ X90) @ X90 @ mactual))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])). 0.20/0.49 thf(c_0_14, plain, ![X88:$i]:((subset @ X88 @ X88 @ mactual)), inference(variable_rename,[status(thm)],[c_0_11])). 0.20/0.49 thf(c_0_15, negated_conjecture, ~((qmltpeq @ (union @ esk4_0 @ esk4_0) @ esk4_0 @ mactual)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.20/0.49 thf(c_0_16, plain, ![X7:$i, X9:$i]:(((qmltpeq @ (union @ X7 @ X9) @ X9 @ mactual)|~((subset @ X7 @ X9 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.49 thf(c_0_17, plain, ![X7:$i]:((subset @ X7 @ X7 @ mactual)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.49 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), ['proof']). 0.20/0.49 # SZS output end CNFRefutation 0.20/0.49 # Parsed axioms : 45 0.20/0.49 # Removed by relevancy pruning/SinE : 0 0.20/0.49 # Initial clauses : 44 0.20/0.49 # Removed in clause preprocessing : 17 0.20/0.49 # Initial clauses in saturation : 27 0.20/0.49 # Processed clauses : 37 0.20/0.49 # ...of these trivial : 0 0.20/0.49 # ...subsumed : 1 0.20/0.49 # ...remaining for further processing : 36 0.20/0.49 # Other redundant clauses eliminated : 0 0.20/0.49 # Clauses deleted for lack of memory : 0 0.20/0.49 # Backward-subsumed : 0 0.20/0.49 # Backward-rewritten : 0 0.20/0.49 # Generated clauses : 4 0.20/0.49 # ...of the previous two non-redundant : 1 0.20/0.49 # ...aggressively subsumed : 0 0.20/0.49 # Contextual simplify-reflections : 0 0.20/0.49 # Paramodulations : 4 0.20/0.49 # Factorizations : 0 0.20/0.49 # NegExts : 0 0.20/0.49 # Equation resolutions : 0 0.20/0.49 # Propositional unsat checks : 0 0.20/0.49 # Propositional check models : 0 0.20/0.49 # Propositional check unsatisfiable : 0 0.20/0.49 # Propositional clauses : 0 0.20/0.49 # Propositional clauses after purity: 0 0.20/0.49 # Propositional unsat core size : 0 0.20/0.49 # Propositional preprocessing time : 0.000 0.20/0.49 # Propositional encoding time : 0.000 0.20/0.49 # Propositional solver time : 0.000 0.20/0.49 # Success case prop preproc time : 0.000 0.20/0.49 # Success case prop encoding time : 0.000 0.20/0.49 # Success case prop solver time : 0.000 0.20/0.49 # Current number of processed clauses : 10 0.20/0.49 # Positive orientable unit clauses : 4 0.20/0.49 # Positive unorientable unit clauses: 0 0.20/0.49 # Negative unit clauses : 1 0.20/0.49 # Non-unit-clauses : 5 0.20/0.49 # Current number of unprocessed clauses: 16 0.20/0.49 # ...number of literals in the above : 43 0.20/0.49 # Current number of archived formulas : 0 0.20/0.49 # Current number of archived clauses : 26 0.20/0.49 # Clause-clause subsumption calls (NU) : 38 0.20/0.49 # Rec. Clause-clause subsumption calls : 37 0.20/0.49 # Non-unit clause-clause subsumptions : 1 0.20/0.49 # Unit Clause-clause subsumption calls : 0 0.20/0.49 # Rewrite failures with RHS unbound : 0 0.20/0.49 # BW rewrite match attempts : 2 0.20/0.49 # BW rewrite match successes : 0 0.20/0.49 # Condensation attempts : 37 0.20/0.49 # Condensation successes : 0 0.20/0.49 # Termbank termtop insertions : 4966 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.009 s 0.20/0.49 # System time : 0.002 s 0.20/0.49 # Total time : 0.010 s 0.20/0.49 # Maximum resident set size: 2152 pages 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.010 s 0.20/0.49 # System time : 0.005 s 0.20/0.49 # Total time : 0.014 s 0.20/0.49 # Maximum resident set size: 1776 pages 0.20/0.49 EOF